Tighter bounds of the First Fit algorithm for the bin-packing problem
نویسندگان
چکیده
In this paper, we present improved bounds for the First Fit algorithm for the bin-packing problem.We prove C FF (L) ≤ 17 10C (L)+ 7 10 for all lists L, and the absolute performance ratio of FF is at most 12 7 . © 2010 Elsevier B.V. All rights reserved.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملPerformance Estimations of First Fit Algorithm for Online Bin Packing with Variable Bin Sizes and LIB constraints
We consider the NP Hard problem of online Bin Packing while requiring that larger (or longer) items be placed below smaller (or shorter) items — we call such a version the LIB version of problems. Bin sizes can be uniform or variable. We provide analytical upper bounds as well as computational results on the asymptotic approximation ratio for the first fit algorithm.
متن کاملA Tighter Lower Bound for Optimal Bin Packing
In this paper, we present an O(n1ogn) algorithm to compute a tighter lower bound for the one-dimensional bin packing problem. We have simulated the algorithm on randomly generated bin packing problems with item sizes drawn uniformly from (a, b], where 0 5 a < b 5 B and B is bin size. Using our lower bound, the average error of BFD is less than 2%. For a + b > B, the error is less than 0.003%. K...
متن کاملAn Alternative Heuristics for Bin Packing Problem
This study describes an alternative development of metaheuristic approaches to automate a one dimensional problem. Extensive computational testing is done to demonstrate the effectiveness of the proposed heuristic, a Variable Neighbourhood Search (VNS)-based algorithm. Several heuristics algorithms that have been used for solving the bin packing problem, Exact algorithm, Random Algorithm, First...
متن کاملOnline Bandwidth packing with symmetric distribution
We consider the following stochastic bin packing process: the items arrive continuously over time to a server and are packed into bins of unit size according to an online algorithm. The unpacked items form a queue. The items have random sizes with symmetric distribution. Our first contribution identifies some monotonicity properties of the queueing system that allow to derive bounds on the queu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010